Suffix tree

Results: 142



#Item
81Want to store date in the smallest possible space? Use data compression! Compression for Data Structures  LZ- FAMILY,

Want to store date in the smallest possible space? Use data compression! Compression for Data Structures LZ- FAMILY,

Add to Reading List

Source URL: yury.name

Language: English - Date: 2006-10-24 14:07:00
82MRCSI: Compressing and Searching String Collections with Multiple References Sebastian Wandelt and Ulf Leser Humboldt-Universitat ¨ zu Berlin, Wissensmanagement in der Bioinformatik,

MRCSI: Compressing and Searching String Collections with Multiple References Sebastian Wandelt and Ulf Leser Humboldt-Universitat ¨ zu Berlin, Wissensmanagement in der Bioinformatik,

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2014-12-17 10:07:16
83LINGO: An Algorithm for Clustering of Web Search Results

LINGO: An Algorithm for Clustering of Web Search Results

Add to Reading List

Source URL: project.carrot2.org

Language: English - Date: 2015-01-09 08:48:15
84Inf Syst Front[removed]:115–125 DOI[removed]s10796[removed]Domain-specific Chinese word segmentation using suffix tree and mutual information Daniel Zeng & Donghua Wei & Michael Chau &

Inf Syst Front[removed]:115–125 DOI[removed]s10796[removed]Domain-specific Chinese word segmentation using suffix tree and mutual information Daniel Zeng & Donghua Wei & Michael Chau &

Add to Reading List

Source URL: www.business.hku.hk

Language: English - Date: 2011-05-16 02:17:11
85Microsoft Word - PAISI[removed]doc

Microsoft Word - PAISI[removed]doc

Add to Reading List

Source URL: www.business.hku.hk

Language: English - Date: 2008-06-12 20:01:56
86Suffix arrays: A new method for on-line string searches Udi Manber1 Gene Myers2 Department of Computer Science

Suffix arrays: A new method for on-line string searches Udi Manber1 Gene Myers2 Department of Computer Science

Add to Reading List

Source URL: webglimpse.net

Language: English - Date: 2002-10-23 23:03:02
87Algorithms on Strings  Maxime Crochemore Christophe Hancart Thierry Lecroq

Algorithms on Strings Maxime Crochemore Christophe Hancart Thierry Lecroq

Add to Reading List

Source URL: www-igm.univ-mlv.fr

Language: English - Date: 2009-07-11 11:28:13
88Compact trie clustering for overlap detection in news Richard Elling Moe, Dag Elgesem Department of information science and media studies University of Bergen  Abstract

Compact trie clustering for overlap detection in news Richard Elling Moe, Dag Elgesem Department of information science and media studies University of Bergen Abstract

Add to Reading List

Source URL: www.nik.no

Language: English - Date: 2014-01-08 09:35:26
89Pseudo-realtime Pattern Matching: Closing the Gap Rapha¨el Clifford and Benjamin Sach Department of Computer Science, University of Bristol,UK {clifford, sach}@cs.bris.ac.uk

Pseudo-realtime Pattern Matching: Closing the Gap Rapha¨el Clifford and Benjamin Sach Department of Computer Science, University of Bristol,UK {clifford, sach}@cs.bris.ac.uk

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2010-08-13 10:16:27
90Theory Comput Syst[removed]: 269–296 DOI[removed]s00224[removed]Optimal Cache-Oblivious Mesh Layouts Michael A. Bender · Bradley C. Kuszmaul · Shang-Hua Teng · Kebin Wang

Theory Comput Syst[removed]: 269–296 DOI[removed]s00224[removed]Optimal Cache-Oblivious Mesh Layouts Michael A. Bender · Bradley C. Kuszmaul · Shang-Hua Teng · Kebin Wang

Add to Reading List

Source URL: supertech.csail.mit.edu

Language: English - Date: 2015-02-18 01:45:02